A Decision Procedure for a Temporal Belief Logic

نویسندگان

  • Michael Wooldridge
  • Michael Fisher
چکیده

This paper presents a temporal belief logic called LTB. In addition to the usual connectives of linear discrete temporal logic, LTB contains an indexed set of modal belief connectives,via which it is possible to represent the belief systems of resource-bounded reasoning agents. The applications of LTB in general, and its use for representing the dynamic properties of multi-agent AI systems in particular, are discussed in detail. A tableau-based decision procedure for LTB is then described, and some examples of its use are presented. The paper concludes with a discussion and future work proposals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Procedure for Temporal Logic of Belief and Actions

A temporal logic of belief and actions (TLBA) is considered. The TLBA allows us to express informational and dynamic properties of computational agents. The considered fragment of TLBA allows one: (1) to present a deduction-based structured decision procedure; (2) to separate a decision procedure for so-called induction-free formulas and (3) to use only logical axioms for such formulas. The mai...

متن کامل

Decision Procedure for a Fragment of Temporal Logic of Belief and Actions with Quantified Agent and Action Variables

A decision procedure for a fragment of temporal logic of belief and action with quantified agent and actions variables (TLBAQ) is presented. A language of TLBAQ contains variables and constants for agents and actions. The language of TLBAQ is a subset of language LORA introduced by M. Wooldridge. The TLBAQ consists of two components: informational and dynamic. An informational (agent) component...

متن کامل

Technical Report: Distribution Temporal Logic: Combining Correctness with Quality of Estimation

We present a new temporal logic called Distribution Temporal Logic (DTL) defined over predicates of belief states and hidden states of partially observable systems. DTL can express properties involving uncertainty and likelihood that cannot be described by existing logics. A co-safe formulation of DTL is defined and algorithmic procedures are given for monitoring executions of a partially obser...

متن کامل

A MONA-based Decision Procedure for Propositional Interval Temporal Logic

Interval Temporal Logic (ITL) is a finite-time linear temporal logic with applications in hardware verification, temporal logic programming and specification of multimedia documents. Due to the inherently nonelementary complexity of its decision problem, efficient ITL-based verification tools have been difficult to develop. We give a new decision procedure for Propositional ITL (PITL) implement...

متن کامل

Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear tim

We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common and distributed knowledge for all coalitions of agents. The tableau procedure runs in exponential time, matching the lower bound obtained by Halpern and Vardi for a fragment of our logic, thus providing a complexity-opti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994